Grouping Techniques for Scheduling Problems: Simpler and Faster
نویسندگان
چکیده
منابع مشابه
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
We give new methods for generating and using “strong trapdoors” in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), and asymptotically optimal with very small hidden constants. Our methods involve a new kind of trapdoor, and include specialized algorithms for inverting LWE, randomly sampling SIS preimages, and securely delegating trapdoor...
متن کاملFaster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different approach to these problems which yields faster and much simpler algorithms. Our approach also allows us to substitute shortest path computations for min-cost flow computations in computing maximum concurrent flow and min...
متن کاملFaster and simpler approximation algorithms for mixed packing and covering problems
We propose an algorithm for approximately solving the mixed packing and covering problem; given a convex compact set ∅ = B ⊆ RN , either compute x ∈ B such that f (x) ≤ (1 + )a and g(x) ≥ (1 − )b or decide that {x ∈ B | f (x) ≤ a, g(x) ≥ b} = ∅. Here f, g : B → RM + are vectors whose components are M non-negative convex and concave functions, respectively, and a, b ∈ RM ++ are constant positive...
متن کاملFaster and Simpler Minimal Conflicting Set Identification
Let C be a finite set of n elements and R = {r1, r2, . . . , rm} a family of m subsets of C. A subset X of R verifies the Consecutive Ones Property (C1P) if there exists a permutation P of C such that each ri in X is an interval of P . A Minimal Conflicting Set (MCS) S ⊆ R is a subset of R that does not verify the C1P, but such that any of its proper subsets does. In this paper, we present a ne...
متن کاملFaster and Simpler Approximation of Stable Matchings
We give a 3 2 -approximation algorithm for finding stable matchings that runs in O(m) time. The previous most well-known algorithm, by McDermid, has the same approximation ratio but runs in O(nm) time, where n denotes the number of people and m is the total length of the preference lists in a given instance. In addition, the algorithm and the analysis are much simpler. We also give the extensio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2007
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-007-9086-6